erasure code造句

• Two results are presented on the maximum tolerable loss fraction, i . e . threshold, for regular low-density erasure codes
  提出了正则低密度纠删码可接受最大损失的两个结论。
• Improved right regular sequences of low-density erasure codes are presented, and it is testified that the sequences are asymptotically quasi-optimal
  提出了一种改进型右边正则序列，证明了此序列为渐近拟最优的。
• It is shown that low-density erasure codes based on ( d, 2d )-regular sequences of degree distribution are not close to optimal ( d > 3 ) . 3
  从理论上证明了基于(d，2d)-正则度序列的低密度纠删码都不是渐近最优码(d3)；3
• It is pointed out that the design of sequences of degree distribution in bipartite graphs is one of the most important problems in constructing low-density erasure codes
  其中二部图度序列的设计是构造低密度纠删码的最关键问题之一。
• Based on the known principle of fixed points in mathematical analysis, a sufficient convergence condition of the erasure recover algorithm for low-density erasure codes is shown . 5
  基于著名的不动点原理，证明了低密度纠删码的删除错误恢复算法稳定收敛的一充分条件；5
• The system uses erasure codes as a means to recreate data in the event that one or more servers fail . the implementation described can tolerate failure rates that approach 33 %
  本系统使用一个erasurecode作为恢复方案，能够在部分分片丢失的情况将数据文件恢复，其容忍的失败率可以达到33。
• In the meantime, simulations of cascaded low-density erasure codes based on a few types of special sequences of degree distribution available are given, together with performance analyses on these codes . 4
  同时，对基于几类现有典型度分布序列的级联型低密度纠删码进行了模拟仿真及性能分析；4
• Sequences of degree distribution for low-density erasure codes are investigated . some analytical properties of the heavy-tail / poisson sequences, right-regular sequences and general capacity-achieving sequences for low-density erasure codes are shown . 7
  对低密度纠删码的度分布序列进行了研究，证明了heavy-tail/poisson序列、右边正则序列和一般的逼近容量度序列的若干分析性质。
• Sequences of degree distribution for low-density erasure codes are investigated . some analytical properties of the heavy-tail / poisson sequences, right-regular sequences and general capacity-achieving sequences for low-density erasure codes are shown . 7
  对低密度纠删码的度分布序列进行了研究，证明了heavy-tail/poisson序列、右边正则序列和一般的逼近容量度序列的若干分析性质。
• In this dissertation, emphasis is put on making a detailed study of theoretical problems on design methods, thresholds and analytical properties of sequences of degree distribution for low-density erasure codes . some positive results on the above problems are obtained and summarized as follow : 1
  本文着重对级联型低密度纠删码度分布序列的设计方法、阈值和分析性质等理论问题进行了深入的研究，获得了几个关键性的研究成果，主要概括为：1
• Cascaded low-density erasure codes are based on sparse random bipartite graphs . very efficient linear time encoding and erasure recover algorithms with the arbitrarily near erasure channel capacity performance of the codes with respect to the algorithms have made them one of the most optimal coding techniques up to now
  基于稀疏随机二部图的级联型低密度纠删码因其线性时间的编译码算法和可任意逼近删除信道容量限而成为目前最佳编码技术之一。
• erasure codes which belong to standard classes of rs codes and their erasure correcting principles are introduced with emphasis on cascaded low-density erasure codes with linear time encoding and erasure recover algorithms . the encoding and decoding complexities of these codes are analyzed . 2
  介绍了标准的rs码类纠删码及其纠删原理，重点介绍了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了这几类纠删码的编译码复杂度；2
• Erasure codes which belong to standard classes of rs codes and their erasure correcting principles are introduced with emphasis on cascaded low-density erasure codes with linear time encoding and erasure recover algorithms . the encoding and decoding complexities of these codes are analyzed . 2
  介绍了标准的rs码类纠删码及其纠删原理，重点介绍了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了这几类纠删码的编译码复杂度；2
• The principles of erasure codes used under binary erasure channels are summarized and erasure codes which belong to standard classes of rs codes are introduced with emphasis on cascaded low-density erasure codes with linear time encoding and erasure recover algorithms . thresholds of regular degree distributions are analyzed . it is shown that low-density erasure codes based on ( d, 2d )-regular sequences of degree distribution are not close to optimal ( d 3 ) . two pares of irregular degree distribution sequences are introduced and a pare of improved right regular sequences of low-density erasure codes are presented, it is testified that the new sequences are asymptotically quasi-optimal . in the meantime, simulations of cascaded low-density erasure codes based on a few types of special sequences of degree distribution available are given, together with performance analyses on these codes
  阐述了应用于删除信道下的纠删码基本原理，介绍了两类标准的rs码类纠删码，重点分析了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了正则度分布的阈值，对正则低密度校验码在删除信道下的纠错性能进行了仿真，从理论上证明了基于(d，2d)-正则度序列的低密度纠删码都不是渐近最优码(d3)，同时还分析了非正则低密度校验码的度序列设计，基于右边正则序列提出了一种改进型右边正则序列，证明了此序列为渐近拟最优的，对基于几类现有典型度分布序列的级联型低密度纠删码进行了模拟仿真及性能分析；3
• The principles of erasure codes used under binary erasure channels are summarized and erasure codes which belong to standard classes of rs codes are introduced with emphasis on cascaded low-density erasure codes with linear time encoding and erasure recover algorithms . thresholds of regular degree distributions are analyzed . it is shown that low-density erasure codes based on ( d, 2d )-regular sequences of degree distribution are not close to optimal ( d 3 ) . two pares of irregular degree distribution sequences are introduced and a pare of improved right regular sequences of low-density erasure codes are presented, it is testified that the new sequences are asymptotically quasi-optimal . in the meantime, simulations of cascaded low-density erasure codes based on a few types of special sequences of degree distribution available are given, together with performance analyses on these codes
  阐述了应用于删除信道下的纠删码基本原理，介绍了两类标准的rs码类纠删码，重点分析了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了正则度分布的阈值，对正则低密度校验码在删除信道下的纠错性能进行了仿真，从理论上证明了基于(d，2d)-正则度序列的低密度纠删码都不是渐近最优码(d3)，同时还分析了非正则低密度校验码的度序列设计，基于右边正则序列提出了一种改进型右边正则序列，证明了此序列为渐近拟最优的，对基于几类现有典型度分布序列的级联型低密度纠删码进行了模拟仿真及性能分析；3
• The principles of erasure codes used under binary erasure channels are summarized and erasure codes which belong to standard classes of rs codes are introduced with emphasis on cascaded low-density erasure codes with linear time encoding and erasure recover algorithms . thresholds of regular degree distributions are analyzed . it is shown that low-density erasure codes based on ( d, 2d )-regular sequences of degree distribution are not close to optimal ( d 3 ) . two pares of irregular degree distribution sequences are introduced and a pare of improved right regular sequences of low-density erasure codes are presented, it is testified that the new sequences are asymptotically quasi-optimal . in the meantime, simulations of cascaded low-density erasure codes based on a few types of special sequences of degree distribution available are given, together with performance analyses on these codes
  阐述了应用于删除信道下的纠删码基本原理，介绍了两类标准的rs码类纠删码，重点分析了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了正则度分布的阈值，对正则低密度校验码在删除信道下的纠错性能进行了仿真，从理论上证明了基于(d，2d)-正则度序列的低密度纠删码都不是渐近最优码(d3)，同时还分析了非正则低密度校验码的度序列设计，基于右边正则序列提出了一种改进型右边正则序列，证明了此序列为渐近拟最优的，对基于几类现有典型度分布序列的级联型低密度纠删码进行了模拟仿真及性能分析；3
• The principles of erasure codes used under binary erasure channels are summarized and erasure codes which belong to standard classes of rs codes are introduced with emphasis on cascaded low-density erasure codes with linear time encoding and erasure recover algorithms . thresholds of regular degree distributions are analyzed . it is shown that low-density erasure codes based on ( d, 2d )-regular sequences of degree distribution are not close to optimal ( d 3 ) . two pares of irregular degree distribution sequences are introduced and a pare of improved right regular sequences of low-density erasure codes are presented, it is testified that the new sequences are asymptotically quasi-optimal . in the meantime, simulations of cascaded low-density erasure codes based on a few types of special sequences of degree distribution available are given, together with performance analyses on these codes
  阐述了应用于删除信道下的纠删码基本原理，介绍了两类标准的rs码类纠删码，重点分析了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了正则度分布的阈值，对正则低密度校验码在删除信道下的纠错性能进行了仿真，从理论上证明了基于(d，2d)-正则度序列的低密度纠删码都不是渐近最优码(d3)，同时还分析了非正则低密度校验码的度序列设计，基于右边正则序列提出了一种改进型右边正则序列，证明了此序列为渐近拟最优的，对基于几类现有典型度分布序列的级联型低密度纠删码进行了模拟仿真及性能分析；3
• The principles of erasure codes used under binary erasure channels are summarized and erasure codes which belong to standard classes of rs codes are introduced with emphasis on cascaded low-density erasure codes with linear time encoding and erasure recover algorithms . thresholds of regular degree distributions are analyzed . it is shown that low-density erasure codes based on ( d, 2d )-regular sequences of degree distribution are not close to optimal ( d 3 ) . two pares of irregular degree distribution sequences are introduced and a pare of improved right regular sequences of low-density erasure codes are presented, it is testified that the new sequences are asymptotically quasi-optimal . in the meantime, simulations of cascaded low-density erasure codes based on a few types of special sequences of degree distribution available are given, together with performance analyses on these codes
  阐述了应用于删除信道下的纠删码基本原理，介绍了两类标准的rs码类纠删码，重点分析了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了正则度分布的阈值，对正则低密度校验码在删除信道下的纠错性能进行了仿真，从理论上证明了基于(d，2d)-正则度序列的低密度纠删码都不是渐近最优码(d3)，同时还分析了非正则低密度校验码的度序列设计，基于右边正则序列提出了一种改进型右边正则序列，证明了此序列为渐近拟最优的，对基于几类现有典型度分布序列的级联型低密度纠删码进行了模拟仿真及性能分析；3
• The principles of erasure codes used under binary erasure channels are summarized and erasure codes which belong to standard classes of rs codes are introduced with emphasis on cascaded low-density erasure codes with linear time encoding and erasure recover algorithms . thresholds of regular degree distributions are analyzed . it is shown that low-density erasure codes based on ( d, 2d )-regular sequences of degree distribution are not close to optimal ( d 3 ) . two pares of irregular degree distribution sequences are introduced and a pare of improved right regular sequences of low-density erasure codes are presented, it is testified that the new sequences are asymptotically quasi-optimal . in the meantime, simulations of cascaded low-density erasure codes based on a few types of special sequences of degree distribution available are given, together with performance analyses on these codes
  阐述了应用于删除信道下的纠删码基本原理，介绍了两类标准的rs码类纠删码，重点分析了具有线性时间编码和恢复算法的渐近好码?级联型低密度纠删码，分析了正则度分布的阈值，对正则低密度校验码在删除信道下的纠错性能进行了仿真，从理论上证明了基于(d，2d)-正则度序列的低密度纠删码都不是渐近最优码(d3)，同时还分析了非正则低密度校验码的度序列设计，基于右边正则序列提出了一种改进型右边正则序列，证明了此序列为渐近拟最优的，对基于几类现有典型度分布序列的级联型低密度纠删码进行了模拟仿真及性能分析；3
• This system adopts and implements the thread pool driven mechanism, each operation as a task is delivered to a task queue and is executed by a special work thread . to communicate between hosts in the system, this system designs and implements a network protocol . this system adopts and implements a erasure code, with which files can be distributed and restored correctly
  本服务器采用并实现了线程池驱动机制，所有操作作为一个任务放到任务队列中由对应的任务处理线程进行处理；设计并实现了一套底层网络协议用于系统中各主机间的交互；利用本地信息保存全局信息查询机制完成了系统间文件信息的同步；采用了一个erasurecode使文件能够有效的分片和恢复；最后采用一种锁机制保证了网络文件操作的同步。